منابع مشابه
Strictly Convex Corners Scatter
We prove the absence of non-scattering energies for potentials in the plane having a corner of angle smaller than π. This extends the earlier result of Bl̊asten, Päivärinta and Sylvester who considered rectangular corners. In three dimensions, we prove a similar result for any potential with a circular conic corner whose opening angle is outside a countable subset of (0, π).
متن کاملMinimum Strictly Convex Quadrangulations of Convex
We present a linear{time algorithm that decomposes a convex polygon conformally into a minimum number of strictly convex quadrilaterals. Moreover, we characterize the polygons that can be decomposed without additional vertices inside the polygon, and we present a linear{time algorithm for such decompositions, too. As an application , we consider the problem of constructing a minimum conformal r...
متن کاملCores of convex and strictly convex games
We follow the path initiated in Shapley (1971) and study the geometry of the core of convex and strictly convex games. We define what we call face games and use them to study the combinatorial complexity of the core of a strictly convex game. Remarkably, we present a picture that summarizes our results with the aid of Pascal’s triangle. JEL classification: C71.
متن کاملPolygon Simplification by Minimizing Convex Corners
Let P be a polygon with r > 0 reflex vertices and possibly with holes. A subsuming polygon of P is a polygon P ′ such that P ⊆ P ′, each connected component R′ of P ′ subsumes a distinct component R of P , i.e., R ⊆ R′, and the reflex corners ofR coincide with the reflex corners ofR′. A subsuming chain of P ′ is a minimal path on the boundary of P ′ whose two end edges coincide with two edges o...
متن کاملOn A Strictly Convex IBM Model 1
IBM Model 1 is a classical alignment model. Of the first generation word-based SMT models, it was the only such model with a concave objective function. For concave optimization problems like IBM Model 1, we have guarantees on the convergence of optimization algorithms such as Expectation Maximization (EM). However, as was pointed out recently, the objective of IBM Model 1 is not strictly conca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista Matemática Iberoamericana
سال: 2017
ISSN: 0213-2230
DOI: 10.4171/rmi/975